Designing rational filter functions for solving eigenvalue problems by contour integration
نویسنده
چکیده
Solving (nonlinear) eigenvalue problems by contour integration, requires an e↵ective discretization for the corresponding contour integrals. In this paper it is shown that good rational filter functions can be computed using (nonlinear least squares) optimization techniques as opposed to designing those functions based on a thorough understanding of complex analysis. The conditions that such an effective filter function should satisfy, are derived and translated in a nonlinear least squares optimization problem solved by optimization algorithms from Tensorlab. Numerical experiments illustrate the validity of this approach.
منابع مشابه
Non-Linear Least-Squares Optimization of Rational Filters for the Solution of Interior Eigenvalue Problems
Rational filter functions improve convergence of contour-based eigensolvers, a popular algorithm family for the solution of the interior eigenvalue problem. We present an optimization method of these rational filters in the Least-Squares sense. Our filters out-perform existing filters on a large and representative problem set, which we show on the example of FEAST. We provide a framework for (n...
متن کاملIfeast
The FEAST eigenvalue algorithm is a subspace iteration algorithm that uses contour integration in the complex plane to obtain the eigenvectors of a matrix for the eigenvalues that are located in any user-defined search interval. By computing small numbers of eigenvalues in specific regions of the complex plane, FEAST is able to naturally parallelize the solution of eigenvalue problems by solvin...
متن کاملNonlinear eigenvalue problems and contour integrals
Beyn’s algorithm for solving nonlinear eigenvalue problems is given a new interpretation and a variant is designed in which the required information is extracted via the canonical polyadic decomposition of a Hankel tensor. A numerical example shows that the choice of the filter function is very important, particularly with respect to where it is positioned in the complex plane.
متن کاملEfficient Complex Continuous-Time IIR Filter Design via Generalized Vector Fitting
We present a novel model identification technique for designing complex infinite-impulseresponse (IIR) continuous-time filters through generalizing the Vector Fitting (VF) algorithm, which is extensively used for continuous-time frequencydomain rational approximation to symmetric functions, to asymmetrical cases. VF involves a twostep pole refinement process based on a linear leastsquares solve...
متن کاملFEAST Eigensolver for Nonlinear Eigenvalue Problems
The linear FEAST algorithm is a method for solving linear eigenvalue problems. It uses complex contour integration to calculate the eigenvectors whose eigenvalues that are located inside some user-defined region in the complex plane. This makes it possible to parallelize the process of solving eigenvalue problems by simply dividing the complex plane into a collection of disjoint regions and cal...
متن کامل